Least Square Based Automatic Threshold Selection for Polygonal Approximation of Digital Curves
نویسندگان
چکیده
Polygonal approximation is a very useful and common representation of digital curves. This application depends on a parameter, which is the threshold value. Various simple piecewise linear curve fitting procedures called the iterative endpoint fit algorithm are available in the literature. The choice of threshold value for convergence of this type of algorithm is a critical point. In this paper, we present a non-parametric method for automatic threshold selection of iterative endpoint fit algorithms. The method is based on least square error between the curve and polygonal line segments and the proposed method guarantees the minimum fitting error. We have compared the results with other algorithms for different synthetic images and real life data.
منابع مشابه
A new iterative approach for dominant points extraction in planar curves
In this paper the problem of dominant point detection on digital curves is addressed. Based on an initial set of curvature points, our approach adds iteratively significant points by looking for the higher curvature contour points. The process continues until all the sums of the distances of contour points in the arcs subtended to the chord between two next dominant points is less then a predef...
متن کاملAn Efficient Framework for Accurate Arterial Input Selection in DSC-MRI of Glioma Brain Tumors
Introduction: Automatic arterial input function (AIF) selection has an essential role in quantification of cerebral perfusion parameters. The purpose of this study is to develop an optimal automatic method for AIF determination in dynamic susceptibility contrast magnetic resonance imaging (DSC-MRI) of glioma brain tumors by using a new preprocessing method.Material and Methods: For this study, ...
متن کاملPolygonal Approximation of Digital Curves Using a Multi-objective Genetic Algorithm
In this paper, a polygonal approximation approach based on a multiobjective genetic algorithm is proposed. In this method, the optimization/exploration algorithm locates breakpoints on the digital curve by minimizing simultaneously the number of breakpoints and the approximation error. Using such an approach, the algorithm proposes a set of solutions at its end. This set which is called the Par...
متن کاملPolygonal Approximation Based on Multi-Objective Optimization
In order to solve multiple constraints in the existing polygonal approximation algorithms of digital curves, a new algorithm is proposed in this article. Each control constraint is taken as the optimization objective respectively and the idea of multi-objective optimization is also applied. Vertex positions of the intermediate approximation polygon are represented by a binary sequence, and Hamm...
متن کاملSurvey on Polygonal Approximation Techniques for Digital Planar Curves
Polygon approximation plays a vital role in abquitious applications like multimedia, geographic and object recognition. An extensive number of polygonal approximation techniques for digital planar curves have been proposed over the last decade, but there are no survey papers on recently proposed techniques. Polygon is a collection of edges and vertices. Objects are represented using edges and v...
متن کامل